Progressive Polygonal Meshes
نویسنده
چکیده
In this work we build a progressive polygonal mesh based on face clustering. The basic simplification operations are the edge-removal and the edge-join operations. There is no need to tessellate non-triangular models as the proposed representation is fully polygonal. We investigate three different error measures to build the progressive representation based on a priority queue based face clustering algorithm. The progressive polygonal mesh representation is built with the inverse refinement operations – the edge-insert and edge-split operations, which can be implemented very efficiently within a newly proposed half-edge data structure. We suggest a progressive file format that allows to read a polygonal model faster than with the standard binary file formats. Finally, we extend the proposed half-edge data structure to a progressive representation that does not consume any further storage space and allows for very fast changes in the mesh resolution.
منابع مشابه
Polygonal Mesh Simplification with Face Color and Boundary Edge Preservation Using Quadric Error Metric
In the applications such as scientific and medical visualization, highly detailed polygonal meshes are needed. Rendering these polygonal meshes usually exceeds the capabilities of graphics hardware. To improve rendering efficiency and maintain proper interactivity, the polygonal mesh simplification technique is commonly used to reduce the number of polygons of the mesh and to construct the mult...
متن کامل3D Geometry Compression and Progressive Transmission
Polygonal meshes remain the primary representation for visualization of 3D data in a wide range of industries, including manufacturing, architecture, geographic information systems, medical imaging, robotics, entertainment, and military applications. Because of its widespread use, it is desirable to compress polygonal meshes stored in file servers and exchanged over computer networks to reduce ...
متن کاملProgressive compression of arbitrary textured meshes
In this paper, we present a progressive compression algorithm for textured surface meshes, which is able to handle polygonal non-manifold meshes as well as discontinuities in the texture mapping. Our method applies iterative batched simplifications, which create high quality levels of detail by preserving both the geometry and the texture mapping. The main features of our algorithm are (1) gene...
متن کاملParallel View-Dependent Out-of-Core Progressive Meshes
The complexity of polygonal models is growing faster than the ability of graphics hardware to render them in real-time. If a scene contains many models and textures, it is often also not possible to store the entire geometry in the graphics memory. A common way to deal with such models is to use multiple levels of detail (LODs), which represent a model at different complexity levels. With view-...
متن کاملProgressive compression of generic surface meshes
This paper presents a progressive compression method for generic surface meshes (non-manifold and/or polygonal). Two major contributions are proposed : (1) generic edge collapse and vertex split operators allowing surface simpli cation and re nement of a mesh, whatever its connectivity; (2) a distortion-aware collapse clustering strategy that adapts the decimation granularity in order to optimi...
متن کامل